Provably Good 2D Shape Reconstruction from Unorganized Cross-Sections
نویسندگان
چکیده
This paper deals with the reconstruction of 2-dimensional geometric shapes from unorganized 1-dimensional cross-sections. We study the problem in its full generality following the approach of Boissonnat and Memari [BM07] for the analogous 3D problem. We propose a new variant of this method and provide sampling conditions to guarantee that the output of the algorithm has the same topology as the original object and is close to it (for the Hausdorff distance).
منابع مشابه
Shape reconstruction from unorganized cross-sections
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications where cross-sections of human organs are obtained by means of a free hand ultrasound apparatus. The position and orientation of the cutting planes may be freely chosen which makes the problem substantially more difficult t...
متن کامل3D Reconstruction from Sparse Unorganized Cross Sections
In this thesis work, we propose an algorithm for smooth 3D object reconstruction from unorganized planar cross sections. We address the problem in its full generality, and show its effectiveness on sparse set of cutting planes. Our algorithm is based on construction of a globally consistent signed distance function over the cutting planes. It uses a divide-and-conquer approach utilizing Hermite...
متن کامل3D Surface Reconstruction from Unorganized Sparse Cross Sections
In this paper, we propose an algorithm for closed and smooth 3D surface reconstruction from unorganized planar cross sections. We address the problem in its full generality, and show its effectiveness on sparse set of cutting planes. Our algorithm is based on the construction of a globally consistent signed distance function over the cutting planes. It uses a split-and-merge approach utilising ...
متن کاملInterpolating an unorganized 2D point cloud with a single closed shape
Given an unorganized two-dimensional point cloud, we address the problem of efficiently constructing a single aesthetically pleasing closed interpolating shape, without requiring dense or uniform spacing. Using Gestalt’s laws of proximity, closure and good continuity as guidance for visual aesthetics, we require that our constructed shape be aminimal perimeter, non-self intersectingmanifold.We ...
متن کاملBoolean 2D Shape Similarity for Surface Reconstruction
BOOLEAN 2D SHAPE SIMILARITY FOR SURFACE RECONSTRUCTION Assoc. Prof. Dr. Oscar E. Ruiz (CAD / CAM / CG Laboratory. Mech. Eng. Dept.) Assoc. Prof. Dr. Carlos A. Cadavid (Basic Sciences Dept.) EAFIT University, Medellin, COLOMBIA Abstract Surface reconstruction problem (SRP) from planar samples has been traditionally approached by either (i) using local proximity between data points in adjacent la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 27 شماره
صفحات -
تاریخ انتشار 2008